---
title: "L1-039 古风排版"
created: 2025-11-28
tags:
  - 算法
---

# L1-039 古风排版

## 题目 [L1-039 古风排版](https://pintia.cn/problem-sets/994805046380707840/exam/problems/type/7?problemSetProblemId=994805091888906240&page=0)

![[image-0dd7b4eb.png]]

## 思路分析

## 代码实现

```typescript
#include<bits/stdc++.h>

using namespace std;

#define endl '\n'

#define int long long

using ll = long long;

using ull = unsigned long long;

using PII = pair<int,int>;

using Pll = pair<ll,ll>;

int dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};

const int inf = 0x3f3f3f3f;

const int N=110;

char all[N][N];

signed main()

{

	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);

	int N;cin >> N;

    cin.ignore(); // 忽略换行符，防止影响 getline

    string s;

    getline(cin, s);

    int len = s.size();

    int rows = (len + N - 1) / N;

    vector<vector<char>> grid(rows, vector<char>(N, ' '));

    for (int i = 0; i < len; i++) {

        grid[i / N][i % N] = s[i];

    }

    for (int j = 0; j <=N-1; j++) {

	    for (int i = rows - 1; i >= 0; i--) {

	        cout << grid[i][j];

	    }

	    cout << endl;

	}

    return 0;

 }
```

## 同类题型

## 视频讲解

---
⬅️ [[L1-038 新世界|L1-038 新世界]] 🏠 [[00-天梯赛]] ➡️ [[L1-040 最佳情侣身高差|L1-040 最佳情侣身高差]]